multiobjective fractional programming

optimality conditions of the multiobjective fractional programming

多目标分式规划的最优性条件

Multiobjective fractional programming with set functions

集函数多目标分式规划

the paper discusses the duality theorems for the generalized convex multiobjective fractional programming and get a more general result.

本文讨论了一类多目标广义凸分式规划的对偶定理，其结果是对张吉军的对偶定理的推广。

Systematically discusses the fundamental theorems of weak efficient solution, efficient solution and properly efficient solution for multiobjective fractional programming problems with set functions.

系统地讨论了集函数多目标分式规划的弱有效解、有效解和真有效解的基本定理。

consider the multiobjective fractional programming and establish some saddle optimality conditions;

研究了多目标分式规划问题的鞍点最优性条件；

sufficiency and duality for multiobjective fractional programming with generalized invexity

广义凸多目标分式规划解的充分条件及其对偶定理

Under suitable conditions, we give some theorems connecting multiobjective fractional programming with set functions and its scalarization problems as well as the corresponding saddle point problems.

在一定条件下，论证了集函数多目标分式规划问题与其相应的标量化问题以及鞍点问题之间的密切关系。